#include<bits/stdc++.h>
using namespace std;
const int N = 100010;
int n, m;
int h[N], e[N], ne[N], idx;
int q[N],d[N];//q模拟队列，d记录入度数
void add(int a, int b){
    e[idx] = b;
    ne[idx] = h[a];
    h[a] = idx ++;
}
bool toposort(){
    int hh = 0, tt = -1;//队头，队尾
    for(int i = 1; i <= n; i ++){
        if(!d[i]) q[++ tt] = i;
    }
    while(hh <= tt){
        int t = q[hh ++];
        for(int i = h[t]; i != -1; i = ne[i]){
            int j = e[i];
            d[j] --;
            if(d[j] == 0) q[++ tt] = j;
        }
    }
    return tt == n - 1;
}
int main(){
    memset(h, -1, sizeof h);
    cin >> n >> m;
    for(int i = 0; i < m; i ++){
        int a, b;
        cin >> a >> b;
        add(a, b);
        d[b] ++;
    }
    if(toposort()){
        for(int i = 0; i < n; i ++) cout << q[i] << " ";
    }
    else cout << "-1" << endl;
    return 0;
}